The Substitutional Framework for Sorted Deduction
نویسنده
چکیده
Researchers in artiicial intelligence have recently been taking great interest in hybrid representations , among them sorted logics|logics that link a traditional logical representation to a taxonomic (or sort) representation such as those prevalent in semantic networks. This paper introduces a general framework|the substitutional framework|for integrating logical deduction and sortal deduction to form a deductive system for sorted logic. This paper also presents results that provide the theoretical underpinnings of the framework. A distinguishing characteristic of a deductive system that is structured according to the substitutional framework is that the sort subsystem is invoked only when the logic subsystem performs uniication, and thus sort information is used only in determining what substitutions to make for variables. Unlike every other known approach to sorted deduction, the substitutional framework provides for a systematic transformation of unsorted deductive systems into sorted ones.
منابع مشابه
Ongoing Research Projects Knowledge Representation and Reasoning Deduction with Constraints Constraint Solving
This document provides brief descriptions of research projects that are representative of those conducted within the Intelligent Systems Group. For convenience the document is divided into three sections|knowledge representation and reasoning, machine learning, and natural language processing|although there is signiicant overlap among these. One of the most widely-used and successful approaches...
متن کاملDynamically-Typed Computations for Order-Sorted Equational Presentations
Equational presentations with ordered sorts encompass partially deened functions and subtyping information in an algebraic framework. In this work we address the problem of computing in order-sorted algebras, with very few restrictions on the allowed presentations. We adopt an algebraic framework where equational, membership and existence formulas can be expressed. A complete deduction calculus...
متن کاملA Mechanization of Strong Kleene Logic for Partial Functions
Even though it is not very often admitted, partial functions do play a significant role in many practical applications of deduction systems. Kleene has already given a semantic account of partial functions using three-valued logic decades ago, but there has not been a satisfactory mechanization. Recent years have seen a thorough investigation of the framework of many-valued truth-functional log...
متن کاملA Tableau Calculus for Partial Functions ?
Even though it is not very often admitted, partial functions do play a signiicant role in many practical applications of deduction systems. Kleene has already given a semantic account of partial functions using a three-valued logic decades ago, but there has not been a satisfactory mechanization. Recent years have seen a thorough investigation of the framework of many-valued truth-functional lo...
متن کاملA Combinator-based Order-sorted Higher-order Uniication Algorithm
This paper develops a sound and complete transformation-based algorithm for uniication in an extensional order-sorted combinatory logic supporting constant overloading and a higher-order sort concept. Appropriate notions of order-sorted weak equality and extensionality | reeecting order-sorted-equality in the corresponding lambda calculus given by Johann and Kohlhase | are deened, and the typed...
متن کامل